Lightweight APIT with Bat Optimization with Simulated Annealing Localization for Resource-Constrained Sensor Networks
نویسندگان
چکیده
In a wireless sensor network, information processing, and acquisition, localization technology is the key to making it practically possible application. Approximate Point-in-Triangulation (APIT) most widely used estimation which has high accuracy in localizing nodes ease of deployment real-time environment. Though numerous advantages, some drawbacks make little setback preference are unevenness distribution nodes. Tracking more appropriate for mobile than tracking static The two main types algorithms range-based range-free techniques. an indoor setting, projected range (distance) between anchor unknown node very inaccurate. By utilizing large number already existing access points (APs) approach, this issue can be overcome great extent. utilization multisensor data, such as magnetic, inertial, compass, gyroscope, ultrasonic, infrared, visual, and/or odometer, stressed recent research further increase accuracy. system also makes location predictions future based on historical data. To issue, proposed algorithm APIT with Bat-SA proves its efficiency. Due low error, traditional Bat method accurate APIT. using SA found perform better terms convergence computing rate success rate. order mimic suggested method, paired technique. Simulation evaluation performance efficiency algorithm. metrics parameters latency, map, positioning error neighbor relationship diagram evaluate method.
منابع مشابه
Simulated annealing with asymptotic convergence for nonlinear constrained optimization
In this paper, we present constrained simulated annealing (CSA), an algorithm that extends conventional simulated annealing to look for constrained local minima of nonlinear constrained optimization problems. The algorithm is based on the theory of extended saddle points (ESPs) that shows the one-to-one correspondence between a constrained local minimum and anESP of the corresponding penalty fu...
متن کاملSimulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization
In this paper, we present constrained simulated annealing (CSA), a global minimization algorithm that converges to constrained global minima with probability one, for solving nonlinear discrete nonconvex constrained minimization problems. The algorithm is based on the necessary and sufficient condition for constrained local minima in the theory of discrete Lagrange multipliers we developed earl...
متن کاملSimulated annealing for constrained global optimization
Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be noneonvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generat...
متن کاملOptimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goals of the algorithm is to generate feasible solutions of certain prescribed quality using an average time of the same order of magnitude as that spent by the original CSA with an optimal cooling schedule in generating a solutio...
متن کاملRobust optimization with simulated annealing
Complex systems can be optimized to improve the performance with respect to desired functionalities. An optimized solution, however, can become suboptimal or even infeasible, when errors in implementation or input data are encountered. We report on a robust simulated annealing algorithm that does not require any knowledge of the problems structure. This is necessary in many engineering applicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Communications and Mobile Computing
سال: 2023
ISSN: ['1530-8669', '1530-8677']
DOI: https://doi.org/10.1155/2023/7982038